On provable recursive functions.

Theory of Provable Recursive Functions

Two Notes on Recursive Functions

Introduction. The theory of regressive isols was introduced by J. C. E. Dekker in [7]. The results that we wish to present in this paper belong to this theory and is a continuation of some of our studies in [1], [3] and [4]. We will assume that the reader is familiar with the terminology and some of the main results of the papers listed as references. We let E denote the collection of all nonne...

A Note on Recursive Functions

In this paper, we propose a new and elegant deenition of the class of recursive functions, analogous to Kleene's deenition but diiering in the primitives taken, thus demonstrating the computational power of the concurrent programming language in-The deenition can be immediately rephrased for any distributive graph in a count-ably extensive category with products, thus allowing a wide, natural g...

Analysis of Parallelism in Recursive Functions on Recursive Data Structures

In functional languages, iterative operations on data collections are naturally expressed using recursive functions on recursive data structures. In this paper, we present a method to extract data parallelism from recursive functions and generate data parallel programs. As the parallel model for object programs, we use polytypic parallel skeletons. This model can express data parallel operation...

Tcs Technical Report Learning Recursive Functions Learning Recursive Functions

Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold’s (1967) model of learning in the limit, many variations, modifications and extensions have been proposed. These models differ in some of the following: the mode of convergence, the requirements intermediate hypotheses have to fulfill, the set of allowed ...